p(p(b(a(x0)), x1), p(x2, x3)) → p(p(b(x2), a(a(b(x1)))), p(x3, x0))
↳ QTRS
↳ DependencyPairsProof
p(p(b(a(x0)), x1), p(x2, x3)) → p(p(b(x2), a(a(b(x1)))), p(x3, x0))
P(p(b(a(x0)), x1), p(x2, x3)) → P(b(x2), a(a(b(x1))))
P(p(b(a(x0)), x1), p(x2, x3)) → P(x3, x0)
P(p(b(a(x0)), x1), p(x2, x3)) → P(p(b(x2), a(a(b(x1)))), p(x3, x0))
p(p(b(a(x0)), x1), p(x2, x3)) → p(p(b(x2), a(a(b(x1)))), p(x3, x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
P(p(b(a(x0)), x1), p(x2, x3)) → P(b(x2), a(a(b(x1))))
P(p(b(a(x0)), x1), p(x2, x3)) → P(x3, x0)
P(p(b(a(x0)), x1), p(x2, x3)) → P(p(b(x2), a(a(b(x1)))), p(x3, x0))
p(p(b(a(x0)), x1), p(x2, x3)) → p(p(b(x2), a(a(b(x1)))), p(x3, x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
P(p(b(a(x0)), x1), p(x2, x3)) → P(x3, x0)
P(p(b(a(x0)), x1), p(x2, x3)) → P(p(b(x2), a(a(b(x1)))), p(x3, x0))
p(p(b(a(x0)), x1), p(x2, x3)) → p(p(b(x2), a(a(b(x1)))), p(x3, x0))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
P(p(b(a(x0)), x1), p(x2, x3)) → P(x3, x0)
Used ordering: Polynomial interpretation [25,35]:
P(p(b(a(x0)), x1), p(x2, x3)) → P(p(b(x2), a(a(b(x1)))), p(x3, x0))
The value of delta used in the strict ordering is 4.
POL(P(x1, x2)) = (4)x_1 + (4)x_2
POL(a(x1)) = x_1
POL(p(x1, x2)) = 1/2 + x_1 + x_2
POL(b(x1)) = x_1
p(p(b(a(x0)), x1), p(x2, x3)) → p(p(b(x2), a(a(b(x1)))), p(x3, x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
P(p(b(a(x0)), x1), p(x2, x3)) → P(p(b(x2), a(a(b(x1)))), p(x3, x0))
p(p(b(a(x0)), x1), p(x2, x3)) → p(p(b(x2), a(a(b(x1)))), p(x3, x0))